منابع مشابه
Greedy Online Bipartite Matching on Random Graphs
We study the average performance of online greedy matching algorithms on G(n, n, p), the random bipartite graph with n vertices on each side and edges occurring independently with probability p = p(n). In the online model, vertices on one side of the graph are given up front while vertices on the other side arrive sequentially; when a vertex arrives its edges are revealed and it must be immedia...
متن کاملGroupies in Random Bipartite Graphs
A vertex of a graph G is called a groupie if its degree is not less than the arithmetic mean of the degrees of its neighbors. Some results concerning groupies have been obtained in deterministic graph theory; see e.g. [1, 5, 6]. Recently, Fernandez de la Vega and Tuza [3] investigate groupies in Erdős-Rényi random graphs G(n, p) and shows that the proportion of the vertices which are groupies i...
متن کاملBipartite decomposition of random graphs
Definition (Maximal size complete bipartite induced subgraph). β(G) := size of maximal complete bipartite induced subgraph of G. Definition (Minimal bipartite decomposion number). τ(G) := minimal number of complete edge disjoint covering bipartite subgraphs of G. Definition (Minimal nontrivial bipartite decomposion number). τ (G) := minimal number of complete edge disjoint covering nontrivial (...
متن کاملThe Choice Number of Random Bipartite Graphs
A random bipartite graph G n n p is obtained by taking two disjoint subsets of vertices A and B of cardinality n each, and by connecting each pair of vertices a ! A and b ! B by an edge randomly and independently with probability p " p n . We show that the choice number of G n n p is, almost surely, 1 # o 1 log2 np for all values of the edge probability p " p n , where the o 1 term tends to 0 a...
متن کاملLargest planar matching in random bipartite graphs
Given a distribution G over labeled bipartite (multi) graphs, G = (W; M; E) where jWj = jMj = n, let L(n) denote the size of the largest planar matching of G (here W and M are posets drawn on the plane as two ordered rows of nodes, an upper and a lower one, and a (w; m) edge is drawn as a straight line between w and m). The main focus of this work is to understand the asymptotic (in n) behavior...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2014
ISSN: 0021-9002,1475-6072
DOI: 10.1239/jap/1409932673